Isolating Resource Consumption in Linear Logic Proof Search

Isolating Resource Consumption in Linear Logic Proof Search

This work presents an extension of the Tag-Frame resource management system previously developed by the authors. The extended proof system is able to isolate the consumption of a given goal/clause without incurring significant extra runtime costs. We believe this feature may have a number of applications, in particular for debugging linear logic programs and specifications in a proof-theoretic ...

Efficient Resource Management for Linear Logic Proof Search

Proof search strategies in linear logic

Linear logic is a refinement of classical logic introduced by J.-Y.Girard to provide means for keeping track of "resources" two assumptions of a formula A are distinguished from a single assumption of A. Although linear logic is not the first attempt for developing "resourceoriented" logics (relevance logic and Lambek calculus being well-known examples), it is by now the mostinvestigated one. S...

The Complexity of Local Proof Search in Linear Logic

Proof search in linear logic is known to be diicult: the provability of propositional linear logic formulas is undecidable. Even without the modalities, multiplicative-additive fragment of propositional linear logic, mall, is known to be pspace-complete, and the pure multiplicative fragment, mll, is known to be np-complete. However, this still leaves open the possibility that there might be pro...

Foundations of Proof Search Strategies Design in Linear Logic

In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving logical foundations for the design of proof search strategies. We propose common theoretical foundations for top-down, bottom-up and mixed proof search procedures with a systematic formalization of strategies construction using the notions of immediate or chaining composition or decomposition, d...